منابع مشابه
The Sieve Problem for All - Purpose Computers
Introduction. The term all-purpose digital computer is often used to indicate a computing machine capable of performing the rational operations using addition and multiplication as basic functions of the arithmetic unit. Even when these operations are supplemented by some discrimination and "extract" commands, for dealing directly with the digits of numbers, there are a number of processes to w...
متن کاملA Three-Level Sieve Algorithm for the Shortest Vector Problem
In AsiaCCS 2011, Wang et al. proposed a two-level heuristic sieve algorithm for the shortest vector problem in lattices, which improves the Nguyen-Vidick sieve algorithm. Inspired by their idea, we present a three-level sieve algorithm in this paper, which is shown to have better time complexity. More precisely, the time complexity of our algorithm is 2 polynomial-time operations and the corres...
متن کاملThe Neumann Sieve Problem and Dimensional Reduction: a Multiscale Approach
We perform a multiscale analysis for the elastic energy of a n-dimensional bilayer thin film of thickness 2δ whose layers are connected through an ε-periodically distributed contact zone. Describing the contact zone as a union of (n − 1)-dimensional balls of radius r ≪ ε (the holes of the sieve) and assuming that δ ≪ ε, we show that the asymptotic memory of the sieve (as ε → 0) is witnessed by ...
متن کاملOn a Combinatorial Problem in Latin Squares
1. Denote by S, an arbitrary latin square with n elements {a 1 , a 2 , . . . , a„ } . A row and column of this square, intersecting on the main diagonal (i .e . diagonal beginning at the left lower corner) will be called corresponding . After striking out n c arbitrary rows and corresponding columns, a square T, with c x c entries remains . Such a square will be called a principal minor. It is ...
متن کاملChen’s double sieve, Goldbach’s conjecture and the twin prime problem
For every even integerN , denote byD(N) andD1,2(N) the number of representations of N as a sum of two primes and as a sum of a prime and an integer having at most two prime factors, respectively. In this paper, we give a new upper bound for D(N) and a new lower bound for D1,2(N), which improve the corresponding results of Chen. We also obtain similar results for the twin prime problem
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1954
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1954-0063388-x